Graph Layout for Applications in Compiler Construction
نویسنده
چکیده
We address graph visualization from the viewpoint of com piler construction Most data structures in compilers are large dense graphs such as annotated control ow graph syntax trees dependency graphs Our main focus is the animation and interactive exploration of these graphs Fast layout heuristics and powerful browsing methods are needed We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graphs
منابع مشابه
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NPcomplete problem in general for which metaheuristic techniques can be applied to find near optimal solution. VSMP has applications in VLSI design, graph drawing and computer language compiler design. VSMP is polynomially sol...
متن کاملAutomatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices
The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...
متن کاملAn Assessment of Call Graph Construction Algorithms
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and sp...
متن کاملEfficient Output-Sensitive Construction of Reeb Graphs
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these cri...
متن کاملStructure Layout Optimizations in the Open64 Compiler: Design, Implementation and Measurements
A common performance problem faced by today's application programs is poor data locality. Real-world applications are often written to traverse data structures in a manner that results in data cache miss overhead. These data structures are often declared as structs in C and classes in C++. Compiler optimizations try to modify the layout of such data structures so that they are accessed in a mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 217 شماره
صفحات -
تاریخ انتشار 1999